a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
f = int(input())
print(max(min(b,c,d)*f + min(a,(d-min(b,c,d)))*e,min(a,d)*e + min((d-min(a,d)),b,c)*f))#include<stdio.h>
int main()
{
int a,b,c,d,e,f,s=0,k;
scanf("%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f);
b=b<c?b:c;
if(f>e)
{
if(d>b)
{
s+=b*f;
d-=b;
k=a<d?a:d;
s+=k*e;
}
else
{
s+=d*f;
}
}
else
{
if(d>a)
{
s+=a*e;
d-=a;
k=b<d?b:d;
s+=k*f;
}
else
{
s+=d*e;
}
}
printf("%d\n",s);
return 0;
}
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |